On the Design of a Tridiagonalization Routine for Banded Matrices
نویسندگان
چکیده
This paper discusses scalability and data layout issues arising in the development of a parallel algorithm for reducing a banded matrix to tridiagonal form. As it turns out, balancing the memory and computational complexity of the reduction of the matrix and the accumulation of the associated orthogonal matrix is the key to scalability and sustained performance.
منابع مشابه
The SBR Toolbox { Software
We present a software toolbox for symmetric band reduction, together with a set of testing and timing drivers. The toolbox contains routines for the reduction of full symmetric matrices to banded form and the reduction of banded matrices to narrower banded or tridiagonal form, with optional accumulation of the orthogonal transformations, as well as repacking routines for storage rearrangement. ...
متن کاملParallel Tridiagonalization through Two-Step Band Reduction
We present a two-step variant of the \successive band reduction" paradigm for the tridiagonalization of symmetric matrices. Here we reduce a full matrix rst to narrow-banded form and then to tridiagonal form. The rst step allows easy exploitation of block orthogonal transformations. In the second step, we employ a new blocked version of a banded matrix tridiagonal-ization algorithm by Lang. In ...
متن کاملA Note on the Accuracy of Symmetric Eigenreduction Algorithms
We present some experimental results illustrating the fact that on highly ill–conditioned Hermitian matrices the relative accuracy of computed small eigenvalues by QR eigenreduction may drastically depend on the initial permutation of the rows and columns. Mostly there was an “accurate” permutation, but there does not seem to be an easy method to get at it. For banded matrices, like those from ...
متن کاملA Framework for Symmetric Band
This paper develops a framework for bandwidth reduction and tridiagonalization algorithms for symmetric banded matrices. The algorithm family includes the algorithms by Rutishauser and Schwarz, which underly the EISPACK and LAPACK implementations, and the algorithm recently proposed by Lang. Our framework leads to algorithms that require fewer oating-point operations, allow for space-time trade...
متن کاملTridiagonalization Costs of the Bandwidth Contraction and Rutishauser-Schwarz Algorithms
In this paper we perform detailed complexity analyses of the Bandwidth Contraction and Rutishauser-Schwarz tridiagonalization algorithms using a general framework for the analysis of algorithms employing sequences of either standard or fast Givens transformations. Each algorithm's analysis predicts the number of ops required to reduce a generic densely banded symmetric matrix to tridiagonal for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995